Graph-theoretic properties in computational complexity

Information-Theoretic Computational Complexity

This paper attempts to describe, in nontechnical language, some of the concepts and methods of one school of thought regarding computational complexity. It applies the viewpoint of information theory to computers. This will first lead us to a definition of the degree of randomness of individual binary strings, and then to an information-theoretic version of Gödel's theorem on the limitations of...

Computational properties of argument systems satisfying graph-theoretic constraints

One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been classified as complete for classes such as NP, co-NP, and . In consequence, a number of researchers have considered methods for specialising the structure of such systems so as to identify classes for which efficient dec...

Graph-theoretic Arguments in Circuit Complexity

Neural complexity: a graph theoretic interpretation.

One of the central challenges facing modern neuroscience is to explain the ability of the nervous system to coherently integrate information across distinct functional modules in the absence of a central executive. To this end, Tononi et al. [Proc. Natl. Acad. Sci. USA. 91, 5033 (1994)] proposed a measure of neural complexity that purports to capture this property based on mutual information be...

A Graph Theoretic Interpretation of Neural Complexity

One of the central challenges facing modern neuroscience is to explain the ability of the nervous system to coherently integrate information across distinct functional modules in the absence of a central executive. To this end Tononi et al. [Proc. Nat. Acad. Sci. USA 91, 5033 (1994)] proposed a measure of neural complexity that purports to capture this property based on mutual information betwe...